An Efficient Algorithm to Solve the Conditional Covering Problem on Trapezoid Graphs
نویسندگان
چکیده
منابع مشابه
An Efficient Genetic Algorithm to Solve the Intermodal Terminal Location problem
The exponential growth of the flow of goods and passengers, fragility of certain products and the need for the optimization of transport costs impose on carriers to use more and more multimodal transport. In addition, the need for intermodal transport policy has been strongly driven by environmental concerns and to benefit from the combination of different modes of transport to cope with the in...
متن کاملA GRASP algorithm to solve the unicost set covering problem
The set covering problem (SCP) is a wellknown combinatorial optimization problem. We present a GRASP algorithm to Unicost Set Covering Problem, a special case of the Set Covering Problem where no distinction is made between covering sets. The most significant contribution of the algorithm is the incorporation of a local improvement procedure based on the heuristics to solve satisfiability probl...
متن کاملOn Conditional Covering Problem
The Conditional Covering Problem (CCP) aims to locate facilities on a graph, where the vertex set represents both the demand points and the potential facility locations. The problem has a constraint that each vertex can cover only those vertices that lie within its covering radius and no vertex can cover itself. The objective of the problem is to find a set that minimizes the sum of the facilit...
متن کاملan efficient genetic algorithm to solve the intermodal terminal location problem
the exponential growth of the flow of goods and passengers, fragility of certain products and the need for the optimization of transport costs impose on carriers to use more and more multimodal transport. in addition, the need for intermodal transport policy has been strongly driven by environmental concerns and to benefit from the combination of different modes of transport to cope with the in...
متن کاملEfficient algorithm for the vertex connectivity of trapezoid graphs
The intersection graph of a collection of trapezoids with corner points lying on two parallel lines is called a trapezoid graph. These graphs and their generalizations were applied in various fields, including modeling channel routing problems in VLSI design and identifying the optimal chain of non-overlapping fragments in bioinformatics. Using modified binary indexed tree data structure, we de...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ISRN Discrete Mathematics
سال: 2011
ISSN: 2090-7788
DOI: 10.5402/2011/213084